By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.
Table of Contents
Search This Issue
Volume 25, Issue 3, pp. 477-696

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Strongly Competitive Algorithms for Paging with Locality of Reference

Sandy Irani, Anna R. Karlin, and Steven Phillips

pp. 477-497

BibTeX  Abstract Full Text:  PDF

On the Value of Coordination in Distributed Decision Making

Sandy Irani and Yuval Rabani

pp. 498-519

BibTeX  Abstract Full Text:  PDF

Complexity of Sub-Bus Mesh Computations

Anne Condon, Richard Ladner, Jordan Lampe, and Rakesh Sinha

pp. 520-539

BibTeX  Abstract Full Text:  PDF

Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques

Haim Kaplan and Ron Shamir

pp. 540-561

BibTeX  Abstract Full Text:  PDF

Efficiently Planning Compliant Motion in the Plane

J. Friedman, J. Hershberger, and J. Snoeyink

pp. 562-599

BibTeX  Abstract Full Text:  PDF

On-Line Algorithms for Path Selection in a Nonblocking Network

Sanjeev Arora, F. T. Leighton, and Bruce M. Maggs

pp. 600-625

BibTeX  Abstract Full Text:  PDF

The Linkage of a Graph

Lefteris M. Kirousis and Dimitris M. Thilikos

pp. 626-647

BibTeX  Abstract Full Text:  PDF

An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score

Sampath K. Kannan and Eugene W. Myers

pp. 648-662

BibTeX  Abstract Full Text:  PDF

Full Abstraction and the Context Lemma

Trevor Jim and Albert R. Meyer

pp. 663-696

BibTeX  Abstract Full Text:  PDF